Cylindrical Algebraic Decomposition using validated numerics
نویسندگان
چکیده
منابع مشابه
Layered Cylindrical Algebraic Decomposition
In this paper the idea of a Layered CAD is introduced, a truncation of a CAD to only high dimensional cells. Limiting to full-dimensional cells has already been investigated in the literature, but including another level can be beneficial for applications. A related topological property is defined and related to robotics motion planning. The distribution of cell dimensions in a CAD is investiga...
متن کاملRegular cylindrical algebraic decomposition
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global condition on P that holds for the output of many widely used algorithms. We also show the same for S of dimension at most 3 and P a strong cylindrical algeb...
متن کاملAdvances in cylindrical algebraic decomposition
Cylindrical Algebraic Decomposition (CAD) was initially introduced to tackle the classic problem of quantifier elimination over real closed algebraic fields, however it has since seen many applications in its own right. Given a set of polynomials, multiple algorithms exist to produce a CAD such that over each cell the polynomials have constant sign. Inherently doubly exponential in the number o...
متن کاملCAD Adjacency Computation Using Validated Numerics
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and topological properties e.g. homology groups. Other applications include visualization and path planning. Our algorithm determines cell adjacency information using...
متن کاملScanning Index Sets with Polynomial Bounds Using Cylindrical Algebraic Decomposition
Automatic, model-based program transformation relies on the ability to generate code from a model description of the program. In the context of automatic parallelisation, cache optimisation and similar transformations, the task is to generate loop nests which enumerate the iteration points within given domains. Several approaches to code generation from polyhedral descriptions of iteration sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2006
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2006.06.004